Collisions in the Original Version of a Chaotic Hash Function
نویسنده
چکیده
At the Crypto 2005 rump session, a new hash function based upon a chaotic map was presented. We display several messages that collide to the same output for this hash function.
منابع مشابه
Improved Collision Attack on MD4
In this paper, we propose an attack method to find collisions of MD4 hash function. This attack is the improved version of the attack which was invented by Xiaoyun Wang et al [1]. We were able to find collisions with probability almost 1, and the average complexity to find a collision is upper bounded by three times of MD4 hash operations. This result is improved compared to the original result...
متن کاملAn Improved Hash Function Based on the Tillich-Zémor Hash Function
Using the idea behind the Tillich-Zémor hash function, we propose a new hash function. Our hash function is parallelizable and its collision resistance is implied by a hardness assumption on a mathematical problem. Also, it is secure against the known attacks. It is the most secure variant of the Tillich-Zémor hash function until now.
متن کاملSTRUCTURAL DAMAGE PROGNOSIS BY EVALUATING MODAL DATA ORTHOGONALITY USING CHAOTIC IMPERIALIST COMPETITIVE ALGORITHM
Presenting structural damage detection problem as an inverse model-updating approach is one of the well-known methods which can reach to informative features of damages. This paper proposes a model-based method for fault prognosis in engineering structures. A new damage-sensitive cost function is suggested by employing the main concepts of the Modal Assurance Criterion (MAC) on the first severa...
متن کاملCollision Analysis and Improvement of a Parallel Hash Function based on Chaotic Maps with Changeable Parameters
Recently, a parallel hash function based on chaotic maps with changeable parameters was proposed by Li et al (2011, pp.1305-1312). In this paper, the security of it is analyzed and the weakness of the architecture is pointed out. It is found that the main limitations are the error using of floor, round and exclusive OR operations in the algorithm. In order to counterstrike these, some improveme...
متن کاملCryptanalysis of the Modified Version of the Hash Function Proposed at PKC'98
In the conference PKC’98, Shin et al. proposed a dedicated hash function of the MD family. In this paper, we study the security of Shin’s hash function. We analyze the property of the Boolean functions, the message expansion, and the data dependent rotations of the hash function. We propose a method for finding the collisions of the modified Shin’s hash function and show that we can find collis...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- IACR Cryptology ePrint Archive
دوره 2005 شماره
صفحات -
تاریخ انتشار 2005